Lattice Quad-Tree Indexing Algorithm for a Hexagonal Discrete Global Grid System

Indexing the aperture 3 hexagonal discrete global grid

Indexing a Discrete Global Grid

In an increasingly interconnected world, the development of computer friendly systems for the display and analysis of global data is an important issue. This paper concerns a method for computer representation and manipulation of global data based on multi-resolution subdivisions of regular polyhedra. In particular, the problem of efficiently indexing the cells of such a discrete global grid is...

An Equal Area Quad-tree Global Discrete Grid Subdivision Algorithm Based on Latitude and Longitude Lines

In order to effectively solve the problems of global discrete grid in spatial data management and operations, a novel equal area quad-tree global discrete grid subdivision model based on latitude and longitude lines is proposed in this paper. Coding rules of grid cells, and geometric distortion calculation and analysis of the grid model are also given in the detailed subdivision process. The re...

Hexagonal Discrete Global Grid Systems for Geospatial Computing

Advanced geospatial applications often involve complex computing operations performed under sometimes severe resource constraints. These applications primarily rely on traditional raster and vector data structures based on square lattices. But there is a significant body of research that indicates that data structures based on hexagonal lattices may be a superior alternative for efficient repre...

Indexing of the Discrete Global Grid Using Linear Quadtree

In recent years a method of recursive subdivisions of the triangular faces of the octahedron or icosahedron has been developed for approximating to the surface of the earth. But the triangle-based discrete grids produced by this method are complicated in geometry structure, and is difficult to make such geographical operations as neighbor-finding, spatial searches and so on. In this paper we co...